On the equality between rank and trace of an idempotent matrix

نویسندگان

  • Oskar Maria Baksalary
  • Dennis S. Bernstein
  • Götz Trenkler
چکیده

The paper was inspired by the question whether it is possible to derive the equality between the rank and trace of an idempotent matrix by using only the idempotency property, without referring to any further features of the matrix. It is shown that such a proof can be obtained by exploiting a general characteristic of the rank of any matrix. An original proof of this characteristic is provided, which utilizes a formula for the Moore–Penrose inverse of a partitioned matrix. Further consequences of the rank property are discussed, in particular, several additional facts are established with considerably simpler proofs than those available. Moreover, a collection of new results referring to the coincidence between rank and trace of an idempotent matrix are derived as well. 2010 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some rank equalities for finitely many tripotent matrices

‎A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations‎. ‎Moreover‎, ‎by using this equality and Theorems 8 and 10 in [Chen M‎. ‎and et al‎. ‎On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications‎, ‎The Scientific World Journal 2014 (2014)‎, ‎Article ID 702413‎, ‎7 page...

متن کامل

On the nil-clean matrix over a UFD

 In this paper we characterize all $2times 2$ idempotent and nilpotent matrices over an integral domain and then we characterize all $2times 2$ strongly nil-clean matrices over a PID. Also, we determine when a $2times 2$ matrix  over a UFD is nil-clean.

متن کامل

Residuated Skew Lattice with a Operation

In this paper, we define hedge operation on a residuated skew lattice and investigate some its properties. We get relationships between some special sets as dense, nilpotent, idempotent, regular elements sets and their hedges.  By examples, we show that hedge of a dense element is not a dense and hedge of a regular element is not a regular. Also hedge of a nilpotent element is a nilpotent and h...

متن کامل

Face Recognition Based Rank Reduction SVD Approach

Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

متن کامل

On the spectra of some matrices derived from two quadratic matrices

begin{abstract} The relations between the spectrum of the matrix $Q+R$ and the spectra of the matrices $(gamma + delta)Q+(alpha + beta)R-QR-RQ$, $QR-RQ$, $alpha beta R-QRQ$, $alpha RQR-(QR)^{2}$, and $beta R-QR$ have been given on condition that the matrix $Q+R$ is diagonalizable, where $Q$, $R$ are ${alpha, beta}$-quadratic matrix and ${gamma, delta}$-quadratic matrix, respectively, of ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2010